Any iteration for polynomial equations using linear information has infinite complexity
نویسندگان
چکیده
منابع مشابه
Linear Differential Operators for Polynomial Equations
The results of this paper spring from the elementary fact that an algebraic function satisfies a linear differential equation. Let k0 be a number field and k0 be its algebraic closure. Let P ∈ k0(x)[y] be a squarefree polynomial of degree n in y. The derivation δ = d dx extends uniquely to the algebraic closure k0(x) of k0(x). We define the minimal operator associated with P to be the monic dif...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملIteration Procedure for the N-Dimensional System of Linear Equations
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method is obtained and a simple numerical example is provided.
متن کاملExpressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the i term in a non-Homogenous Linear Recurrence. We use this to derive the infinite determinant that is zero, if and only if, the desired rational can be reached by some term in the recurrence. Second, we de...
متن کاملChaotic iteration for polynomial constraints
In this paper we argue for an alternative way of designing solvers based on interval arithmetic. We achieve constraint propagation over real numbers using chaotic iteration, a general and basic technique used for computing limits of iterations of nite sets of functions. This is carried out in two steps: rst involving computationally \cheap" functions for reducing constraint satisfaction problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90144-5